Routing algorithms

Results: 695



#Item
51Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:43
521242  IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 17,

1242 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 17,

Add to Reading List

Source URL: www.cs.uoi.gr

Language: English - Date: 2006-09-30 04:49:19
53Fast Control Plane Analysis Using an Abstract Representation Aaron Gember-Jacobson∗◦ , Raajay Viswanathan∗◦ , Aditya Akella◦ , Ratul Mahajan† ◦  University of Wisconsin-Madison, † Microsoft Research

Fast Control Plane Analysis Using an Abstract Representation Aaron Gember-Jacobson∗◦ , Raajay Viswanathan∗◦ , Aditya Akella◦ , Ratul Mahajan† ◦ University of Wisconsin-Madison, † Microsoft Research

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2016-07-25 15:03:50
54Speedy : a Sybil-resistant DHT implementation* anquan Liu, Qian Long, Pratiksha aker, Wenting Zheng May 12, Introduction Distributed hash tables (DHTs) are common services that leverage peer-to-peer (P2P)

Speedy : a Sybil-resistant DHT implementation* anquan Liu, Qian Long, Pratiksha aker, Wenting Zheng May 12, Introduction Distributed hash tables (DHTs) are common services that leverage peer-to-peer (P2P)

Add to Reading List

Source URL: css.csail.mit.edu

Language: English - Date: 2014-12-08 14:33:02
55Prof. Roger Wattenhofer phone +fax +Semester/Diploma/Master Thesis “Routing in Dynamic Networks” and “Mobility Models”

Prof. Roger Wattenhofer phone +fax +Semester/Diploma/Master Thesis “Routing in Dynamic Networks” and “Mobility Models”

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:37:00
56Synchronous Counting and Computational Algorithm Design Danny Dolev1 , Janne H. Korhonen2 , Christoph Lenzen3 , Joel Rybicki2 , and Jukka Suomela2 1

Synchronous Counting and Computational Algorithm Design Danny Dolev1 , Janne H. Korhonen2 , Christoph Lenzen3 , Joel Rybicki2 , and Jukka Suomela2 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:08
57Genome Informatics 12: 73–A Multi-Queue Branch-and-Bound Algorithm for Anytime Optimal Search

Genome Informatics 12: 73–A Multi-Queue Branch-and-Bound Algorithm for Anytime Optimal Search

Add to Reading List

Source URL: www.jsbi.org

Language: English - Date: 2002-01-17 03:51:05
58A 4-Geometry Maze Router and Its Application on Multiterminal Nets GENE EU JAN National Taipei University KI-YIN CHANG National Taiwan Ocean University

A 4-Geometry Maze Router and Its Application on Multiterminal Nets GENE EU JAN National Taipei University KI-YIN CHANG National Taiwan Ocean University

Add to Reading List

Source URL: www.ntpu.edu.tw

Language: English - Date: 2005-11-20 09:42:42
59Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN

Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
60On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology Mordechai Shalom1 ? , Prudence W.H. Wong  ??2

On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology Mordechai Shalom1 ? , Prudence W.H. Wong ??2

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2009-06-10 05:42:48